Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs
نویسندگان
چکیده
منابع مشابه
Byzantine Agreement in Polynomial Expected Time
In the classic asynchronous Byzantine agreement problem, communication is via asynchronous message-passing and the adversary is adaptive with full information. In particular, the adversary can adaptively determine which processors to corrupt and what strategy these processors should use as the algorithm proceeds; the scheduling of the delivery of messages is set by the adversary, so that the de...
متن کاملPolynomial-time Algorithms from Ineffective Proofs
We present a constructive procedure for extracting polynomial-time realizers from ineffective proofs of Π2theorems in feasible analysis. By ineffective proof we mean a proof which involves the non-computational principle weak König’s lemma WKL, and by feasible analysis we mean Cook and Urquhart’s system CPV plus quantifierfree choice QF-AC. We shall also discuss the relation between the system ...
متن کاملProofs, Codes, and Polynomial-Time Reducibilities
We show how to construct proof systems for NP languages where a deterministic polynomial-time veriier can check membership, given any N (2=3)+ bits of an N-bit witness of membership. We also provide a slightly super-polynomial time proof system where the veriier can check membership, given only N (1=2)+ bits of an N-bit witness. In addition, we construct proof systems where a deterministic poly...
متن کاملEfficient Oblivious Polynomial Evaluation with Simulation-Based Security
The study of secure multiparty computation has yielded powerful feasibility results showing that any efficient functionality can be securely computed in the presence of malicious adversaries. Despite this, there are few problems of specific interest for which we have highly efficient protocols that are secure in the presence of malicious adversaries under full simulation based definitions (foll...
متن کاملColoring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that either solve the problem in most but not all cases, but are of polynomial time complexity, or that give a correct solution on all input graphs while guaranteeing a polynomial running time on average only. An algorithm of the first ki...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Cryptology
سال: 2007
ISSN: 0933-2790,1432-1378
DOI: 10.1007/s00145-007-9004-8